Advances in Lazy SmallCheck
نویسندگان
چکیده
A property-based testing library enables users to perform lightweight verification of software. This paper presents improvements to the Lazy SmallCheck property-based testing library. Users can now test properties that quantify over first-order functional values and nest universal and existential quantifiers in properties. When a property fails, Lazy SmallCheck now accurately expresses the partiality of the counterexample. These improvements are demonstrated through several practical examples.
منابع مشابه
Hardware-Assisted and Target-Directed Evaluation of Functional Programs
A new reduction machine for lazy functional languages called the Reduceron is proposed. The Reduceron exploits wide, parallel memories to increase evaluation speed, and is prototyped in programmable hardware. It is compared with conventional machines by a theoretical analysis and by an experimental comparison. It is shown that the use of wide, parallel memories in a graph reduction machine can ...
متن کاملFailing Faster: Overlapping Patterns for Property-Based Testing
In property-based testing, a key problem is generating input data that satisfies the precondition of a property. One approach is to attempt to do so automatically, from the definition of the precondition itself. This idea has been realised using the technique of needed narrowing, as in the Lazy SmallCheck system, however in practice this method often leads to excessive backtracking resulting in...
متن کاملProperty-based testing and properties as types : a hybrid approach to supercompiler verification
This thesis describes a hybrid approach to compiler verification. Property-based testing and mechanised proof are combined to support the verification of a supercompiler — a particular source-to-source program optimisation. A careful developer may use formal methods to ensure that their program code is correct to specifications. Poorly constructed compilers (and their associated machinery) can ...
متن کاملFinding the lazy programmer's bugs
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting cases, perhaps biased by what they believe to be the current boundary conditions of the function being tested. Or at least, they were supposed to. A major step forward was the development of property testing. Property testing requires the user to write a few functional properties that are used t...
متن کاملRelation : Lazy Queue Implementation and Analysis
1 Lazy Queue 1.1 Lazy Queue Description The lazy queue [1] is based on multi-list and extends the idea of calendar queue. The set is divided into tree part and only a little part is kept sorted: ❶ a near future (NF) that is kept sorted, ❷ a far future (FF), that is partially sorted1, ❸ a very far future (VFF), that is used as an overflow bucket As time advances, part of the far future (the firs...
متن کامل